A convergence result for an outer approximation scheme
نویسندگان
چکیده
منابع مشابه
A convergence result for an outer approximation scheme
In this work we study the variational inequality problem in finite dimensional spaces. The constraint set we consider has the structure of semi-infinite programming. Standard convergence analysis for outer approximation methods includes boundedness of the constraint set, or, alternatively, coerciveness of the data. Using recession tools, we are able to replace these assumptions by the hypothese...
متن کاملStochastic Perturbation of Sweeping Process and a Convergence Result for an Associated Numerical Scheme
— Here we present well-posedness results for first order stochastic differential inclusions, more precisely for sweeping process with a stochastic perturbation. These results are provided in combining both deterministic sweeping process theory (recently developed in [18] and [19]) and methods concerning the reflection of a Brownian motion ([23] and [31]). In addition, we prove convergence resul...
متن کاملAn approximation hardness result for bipartite Clique
Assuming 3-SAT formulas are hard to refute on average, Feige showed some approximation hardness results for several problems like min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem. We show a similar result for max bipartite clique, but under the assumption, 4-SAT formulas are hard to refute on average. As falsity of the 4-SAT assumption implies falsity...
متن کاملAn Outer-Inner Approximation for separable MINLPs
A common structure in convex mixed-integer nonlinear programs is separable nonlinear functions. In the presence of such structures, we propose three improvements to the outer approximation algorithms. The first improvement is a simple extended formulation, the second is a refined outer approximation, and the third is a heuristic inner approximation of the feasible region. These methods have bee...
متن کاملLocal Linear Convergence of an Outer Approximation Projection Method for Variational Inequalities
Abstract: This paper considers an outer approximation projection method for variational inequalities, in which the projections are not performed on the original set that appears in the variational inequality, but on a polyhedral convex set defined by the linearized constraints. It shows that the method converges linearly, when the starting point is sufficiently close to the solution and the ste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2003
ISSN: 0101-8205
DOI: 10.1590/s0101-82052003000300005